GrAF: A graph-based format for linguistic annotations

ACL 2007: The LAW - Proceedings of The Linguistic Annotation Workshop

Volumn , Issue , 2007, Pages 1-8

  Ide, Nancy ^a   Suderman, Keith ^a  

^a VASSAR COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS ALGORITHMS; BEST PRACTICE GUIDELINES; GRAPH ALGORITHMS; GRAPH REPRESENTATION; GRAPH TRAVERSALS; LINGUISTIC ANNOTATIONS; SINGLE GRAPH; WALL STREET JOURNAL;

ALGORITHMS; DATA MINING; MERGERS AND ACQUISITIONS;

LINGUISTICS;

EID: 84880315865     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A. Cardon and Maxime Crochemore, 1982. Partitioning a graph in O(|A| log2 |V| ).Theoretical Computer Science, 19(1):85-98.
2. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda, 2005. A General Framework for Mining Frequent Subgraphs from Labeled Graphs. Fundamenta Informaticae, 66:1-2, 53-82.
3. Andrew A. Krizhanovsky, 2005. Synonym search in Wikipedia: Synarcher. http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0606097.
4. Dat P.T Nguyen, Yutaka Matsuo, and Mitsuru Ishizuka, 2007. Exploiting Syntactic and Semantic Information for Relation Extraction from Wikipedia. IJCAI Workshop on Text-Mining & Link-Analysis (TextLink 2007).
5. Dominic Widdows and Beate Dorow, 2002. A graph model for unsupervised lexical acquisition. Proceedings of the 19th International Conference on Computational Linguistics, 1093-1099.
6. Evgeniy Gabrilovich and Shaul Markovitch, 2007. Computing Semantic Relatedness Using Wikipediabased Explicit Semantic Analysis. Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India.
7. Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan and Tat- Seng Chua, 2005. Question answering passage retrieval using dependency relations. SIGIR '05: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 400-407.
8. Jeffrey Dean, Monika R. Henzinger, 1999. Finding related pages in the World Wide Web. Computer Networks, 31(11-16):1467-1479.
9. John E. McEneaney, 2001. Graphic and numerical methods to assess navigation in hypertext. International Journal of Human-Computer Studies, 55, 761- 786.
10. Jon M. Kleinberg, 1999. Authoritative sources in a hyper- linked environment. Journal of the ACM 46(5):604-632.
11. Michel Habib, Christophe Paul, Laurent Viennot, 1999. Partition refinement techniques: An interesting algorithmic tool kit. International Journal of Foundations of Computer Science, 10(2):147-170.
12. Mohammed J. Zaki, 2002. Efficiently mining trees in a forest. Proceedings of SIGKDD'02.
13. Nancy Ide and Laurent Romary, 2004. A Registry of Standard Data Categories for Linguistic Annotation. Proceedings of the Fourth Language Resources and Evaluation Conference (LREC), Lisbon, 135-39.
14. Nancy Ide and Laurent Romary, 2004. International Standard for a Linguistic Annotation Framework. Journal of Natural Language Engineering, 10:3-4, 211-225.
15. Nancy Ide and Laurent Romary, 2006. Representing Linguistic Corpora and Their Annotations. Proceedings of the Fifth Language Resources and Evaluation Conference (LREC), Genoa, Italy.
16. Razvan C. Bunescu and Raymond J. Mooney, 2007. Extracting relations from text: From word sequences to dependency paths. In Anne Kao and Steve Poteet (eds.), Text Mining and Natural Language Processing, Springer, 29-44.
17. Sergey Brin, 1998. Extracting patterns and relations from the world wide web. Proceedings of the 1998 International Workshop on the Web and Databases, 172-183.
18. Sisay Fissaha Adafre and Maar ten de Rijke, 2005. Discovering missing links in Wikipedia. Workshop on Link Discovery: Issues, Approaches and Applications. Stephen Bird and Mark Liberman, 2001. A formal framework for linguistic annotation. Speech Communication, 33:1-2, 23-60.
19. Vivi Nastase and Stan Szpakowicz, 2006. Matching syntactic-semantic graphs for semantic relation assignment. Proceedings of TextGraphs: The Second Workshop on Graph Based Methods for Natural Language Processing, 81-88.