Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
user:hladka:playcoref [2009/02/25 21:51] hladka |
user:hladka:playcoref [2009/02/25 22:24] hladka |
||
---|---|---|---|
Line 10: | Line 10: | ||
====== Specification ====== | ====== Specification ====== | ||
+ | |||
Line 25: | Line 26: | ||
* A game of two players. Players are paired randomly. Computer as a player: automatic coreference resolution **???????** | * A game of two players. Players are paired randomly. Computer as a player: automatic coreference resolution **???????** | ||
* Session time up to **???????** minutes. | * Session time up to **???????** minutes. | ||
- | * At the beginning, two first sentences of the document are displayed to each player. The players hook up the nouns and pronouns which refer to the same object independently of each other. If a player hooks up all the related words (s)he keeps in mind then (s)he asks for the next sentence of the document. The session goes on until the end of the session time. (// | + | * At the beginning, two first sentences of the document are displayed to each player. The players hook up the nouns and pronouns which refer to the same object independently of each other. If a player hooks up all the related words in the given sentences |
* What my partner is doing? If (s)he hooks up the same pair of words as hooked up then the pair of words starts **??????? | * What my partner is doing? If (s)he hooks up the same pair of words as hooked up then the pair of words starts **??????? | ||
* The players can re-hook up any word any time in the session. | * The players can re-hook up any word any time in the session. | ||
Line 32: | Line 33: | ||
- POS tagger | - POS tagger | ||
- coreference resolution procedure | - coreference resolution procedure | ||
+ | |||
+ | |||
+ | |||
Line 51: | Line 55: | ||
=== Internal format === | === Internal format === | ||
- | * sgml ## //propose dtd file: include the element '' | + | * sgml ## //propose dtd file: include the element '' |
- | * conversion: csts <-> pml m_coref scheme | + | |
=== (Pre)processing === | === (Pre)processing === | ||
Line 61: | Line 64: | ||
* sentence by sentence | * sentence by sentence | ||
* supervised selection of documents for a session | * supervised selection of documents for a session | ||
+ | |||
Line 68: | Line 72: | ||
* '' | * '' | ||
- | // w1 by mela byt nejvyssi; w2 by mela urcite nejak zohlednit uspesnost automaticke procedury - uspesnost merenou na jakych datech?; w3: kdyz hracum budeme zobrazovat i ta slova, ktera oznacil protihrac a ja je neoznacil, nebudeme je tim tlacit do vynucene shody? pro to, aby w3 bylo ' | + | // w1 by mela byt nejvyssi; w2 by mela urcite nejak zohlednit uspesnost automaticke procedury - uspesnost merenou na jakych datech?; w3: kdyz hracum budeme zobrazovat i ta slova, ktera oznacil protihrac, a ja je neoznacila, nebudeme je tim tlacit do vynucene shody? pro to, aby w3 bylo ' |
- | ===== Output Data ===== | ||
+ | |||
+ | ===== Output Data Needed ===== | ||
+ | * score list ## // | ||
+ | * documents after the '' | ||
+ | * session | ||
+ | * player_A_id, | ||
+ | * document(s) | ||
+ | * number of corrections by player_A and by player_B | ||
+ | * corrections by player_A and by player_B | ||
Line 83: | Line 95: | ||
* arrows | * arrows | ||
* ... | * ... | ||
+ | |||
Line 90: | Line 103: | ||
* tagger ^BH^ ## tool_chain (CAC2.0) | * tagger ^BH^ ## tool_chain (CAC2.0) | ||
* Linh's coreference resolution procedure ^PS^ ## What type of input data the Linh's procedure works with? '' | * Linh's coreference resolution procedure ^PS^ ## What type of input data the Linh's procedure works with? '' | ||
+ | * conversion: csts <-> pml m_coref scheme | ||
====== Motivační publikace ====== | ====== Motivační publikace ====== | ||
Line 99: | Line 113: | ||
* Luis von Ahn, Laura Dabish: //Labelling Images with a Computer Game//, 2004, ([[http:// | * Luis von Ahn, Laura Dabish: //Labelling Images with a Computer Game//, 2004, ([[http:// | ||
- | ===== Anotování koreference v českých datech ===== | + | |
+ | ====== Anotování koreference v českých datech | ||
* PDT 2.0 [[http:// | * PDT 2.0 [[http:// | ||
* rozšířená koreference - viz přehled [[https:// | * rozšířená koreference - viz přehled [[https:// | ||
Line 106: | Line 121: | ||
- | ===== Automatické určování koreference v českých datech - přehled ===== | + | |
+ | |||
+ | ====== Automatické určování koreference v českých datech - přehled ====== | ||
* Dosavadní experimenty | * Dosavadní experimenty | ||
Line 115: | Line 133: | ||
- | ===== Návrh hry - brainstorming ===== | + | |
+ | ====== Návrh hry - brainstorming ====== | ||
**26/5/08 Anja, Bára:** | **26/5/08 Anja, Bára:** | ||
* Vstup: Texty v povrchové podobě, tedy NE tektogramatické stromy | * Vstup: Texty v povrchové podobě, tedy NE tektogramatické stromy | ||
Line 143: | Line 163: | ||
* **Vystup:** dvojice, na kterych se hraci shodli a neshodli. Shoda bude prinosna, ale co delat s temi dvojicemi, ktere oznacil pouze jeden hrac? Muze se objevit jeste jedna sance na shodu, a to ta, ktera prijde z jine partie se stejnym dokumentem. Proto bude muset byt kladen duraz na rizene podsouvani dokumentu do partii. | * **Vystup:** dvojice, na kterych se hraci shodli a neshodli. Shoda bude prinosna, ale co delat s temi dvojicemi, ktere oznacil pouze jeden hrac? Muze se objevit jeste jedna sance na shodu, a to ta, ktera prijde z jine partie se stejnym dokumentem. Proto bude muset byt kladen duraz na rizene podsouvani dokumentu do partii. | ||
* Kontrolni mechanismy, aby hraci nespojovali libovolna dve slova - vzhledem k navrhu na pocitani skore, tj. za shodu, budou hraci aspon castecne motivovani hrat smysluplne. | * Kontrolni mechanismy, aby hraci nespojovali libovolna dve slova - vzhledem k navrhu na pocitani skore, tj. za shodu, budou hraci aspon castecne motivovani hrat smysluplne. | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ====== Specification ====== | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ===== Strategy ===== | ||
+ | * **Hook up the words which refer to the same entity.** | ||
+ | * A game of two players. Players are paired randomly. Computer as a player: automatic coreference resolution **???????** | ||
+ | * Session time up to **???????** minutes. | ||
+ | * At the beginning, two first sentences of the document are displayed to each player. The players hook up the nouns and pronouns which refer to the same object independently of each other. If a player hooks up all the related words in the given sentences (s)he keeps in mind then (s)he asks for the next sentence of the document. The session goes on this way until the end of the session time. (// | ||
+ | * What my partner is doing? If (s)he hooks up the same pair of words as hooked up then the pair of words starts **??????? | ||
+ | * The players can re-hook up any word any time in the session. | ||
+ | * To design the game for a particular language the following data and tools are needed (or are welcome): | ||
+ | - corpus of manually anotated coreference | ||
+ | - POS tagger | ||
+ | - coreference resolution procedure | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ===== Input Texts ===== | ||
+ | |||
+ | === Text Selection === | ||
+ | * CS data ^JM^ | ||
+ | * Anja's data ## // PDT data that are currently being annotated for the extended coreference // | ||
+ | * more ' | ||
+ | * **EN** | ||
+ | * search the data that are available | ||
+ | === Coding === | ||
+ | * utf-8 | ||
+ | |||
+ | === Internal format === | ||
+ | * sgml ## //propose dtd file: include the element '' | ||
+ | |||
+ | === (Pre)processing === | ||
+ | * tagging ## //see Tools needed below// | ||
+ | * acr by Linh ## // dtto // | ||
+ | |||
+ | === Text handling === | ||
+ | * sentence by sentence | ||
+ | * supervised selection of documents for a session | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ===== Scoring ===== | ||
+ | * '' | ||
+ | |||
+ | // w1 by mela byt nejvyssi; w2 by mela urcite nejak zohlednit uspesnost automaticke procedury - uspesnost merenou na jakych datech?; w3: kdyz hracum budeme zobrazovat i ta slova, ktera oznacil protihrac, a ja je neoznacila, nebudeme je tim tlacit do vynucene shody? pro to, aby w3 bylo ' | ||
+ | |||
+ | |||
+ | |||
+ | ===== Output Data Needed ===== | ||
+ | * score list ## // | ||
+ | * documents after the '' | ||
+ | * session | ||
+ | * player_A_id, | ||
+ | * document(s) | ||
+ | * number of corrections by player_A and by player_B | ||
+ | * corrections by player_A and by player_B | ||
+ | |||
+ | |||
+ | ===== Design ===== | ||
+ | * What info to be displayed in the session? | ||
+ | * session time = elapsed time + remaining time | ||
+ | * how many sentences my partner has read so far | ||
+ | * running pts **???????** | ||
+ | * Visualization of the coreference pairs | ||
+ | * colors | ||
+ | * arrows | ||
+ | * ... | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ===== Tools needed ===== | ||
+ | * tagger ^BH^ ## tool_chain (CAC2.0) | ||
+ | * Linh's coreference resolution procedure ^PS^ ## What type of input data the Linh's procedure works with? '' | ||
+ | * conversion: csts <-> pml m_coref scheme | ||
+ | |||
+ |