Converting dependency grammars to efficiently parsable...

Details Converting dependency grammars to efficiently parsable... Converting dependency grammars to efficiently parsable...

2011-06-14

2011-06-14

Han, Qi (Department: 2626)

Data processing: speech signal processing, linguistics, language

Linguistics

C704S009000, C704S010000, C704S257000

Reexamination Certificate

active

07962323

ABSTRACT:
Dependency grammars are transformed to context-free grammars. The context-free grammars can be used in a parser to parse input sentences and identify relationships among words in the sentence.

REFERENCES:
patent: 4829423 (1989-05-01), Tennant
patent: 5060155 (1991-10-01), Van Zuijlen
patent: 5475588 (1995-12-01), Schabes et al.
patent: 6138098 (2000-10-01), Shieber
patent: 6188977 (2001-02-01), Hirota
patent: 6243669 (2001-06-01), Horiguchi
patent: 6332118 (2001-12-01), Yamabana
patent: 6714905 (2004-03-01), Chang
patent: 6983239 (2006-01-01), Epstein
patent: 6985852 (2006-01-01), Wang
patent: 7181386 (2007-02-01), Mohri et al.
patent: 2003/0074187 (2003-04-01), Ait-Mokhtar et al.
patent: 2005/0234701 (2005-10-01), Graehl et al.
patent: 2006/0155526 (2006-07-01), Castillo et al.
patent: 2006/0245641 (2006-11-01), Viola
patent: 2006/0253273 (2006-11-01), Feldman et al.
Nasr et al. “A simple string-rewriting formalism for dependency grammar”. Proceedings of the Workshop on Recent Advances in Dependency Grammar, 2004, pp. 25-32.
Johnson. “Deductive parsing with multiple levels of representation”. In 26th Annual Meeting of the Association for Computational Linguistics, Buffalo, New York, 1988, pp. 241-248.
McDonald et al. “Online learning ofapproximate dependency parsing algorithms”. In Proc.of the 11th Conf. of the European Chapter of the Association for Computational Linguistics, Apr. 2006, pp. 81-88.
Wang et al. “A statistical constraint dependency grammar (CDG) parser”. In Workshop on Incremental Parsing: Bringing Engineering and Cognition Together, 2004, pp. 1-8.
Eisner et al. “Parsing with soft and hard constraints on dependency length”. In Proc. of IWPT, Oct. 2005, pp. 30-41.
Johnson, “Transforming projective bilexical dependency grammars into efficiently-parsable CFGs with unfold-fold”, proceedings of the 45th annual meeting of the Association of computational linguistics, pp. 168-175, Jun. 2007.
J. Eisner “Bilexical Grammars and Their Cubic-Time Parsing Algorithms” Dept. of Computer Science, Rochester, NY 2000, 33 pages.
J. Earley, “An Efficient Context-Free Parsing Algorithm” University of California, Berkeley, 1970, 9 pages.
M. Nederhof, E. Bertsch, “An innovative finite state concept for recognition and parsing of context free languages” Publication, 1999, 20 pages.
J. Eisner, “Three New Probabilistic Models for Dependency Parsing: An Exploration”, CIS Dept., University of Pennsylvania, 1996, 6 pages.
J. Eisner, G. Satta, “Efficient Parsing for Bilexical Context-Free Grammars and Head Automation Grammars”, Proc. of the 37th ACL, 1999. 8 pages.
D. McAllester a reformulation of Eisner and Sata's cubic time parser for split head automata grammars, two (2) slides, 1999, 2 pages.
R. McDonald, “Discriminative Learning and Spanning Tree Algorithms for Dependency Parsing” PhD thesis, Computer and Information Science, University of Pennsylvania, 2006, 240 pages.
J. Eisner, “Bilexical Grammars and a Cubic-Time Probabilistic Parser”, Dept. of Computer and Information Science, University of Pennsylvania, 2000, 45 pages.

Affiliated with

Also associated with

Rating

Converting dependency grammars to efficiently parsable... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Converting dependency grammars to efficiently parsable..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Converting dependency grammars to efficiently parsable... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2656103