U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method, device and system for generalized bidirectional island-driven chart parsing

Patent 6128596 Issued on October 3, 2000. Estimated Expiration Date: Icon_subject April 3, 2018. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Chart parser for stochastic unification grammar
Patent #: 4984178
Issued on: 01/08/1991
Inventor: Hemphill, et al.

Method and system for the representation of multiple analyses in dependency grammar and parser for generating such representation
Patent #: 5060155
Issued on: 10/22/1991
Inventor: van Zuijlen

Method and device for parsing natural language sentences and other sequential symbolic expressions
Patent #: 5960384
Issued on: 09/28/1999
Inventor: Brash

Using speculative parsing to process complex input data Patent #: 5963742
Issued on: 10/05/1999
Inventor: Williams

Inventor

Assignee

Application

No. 054601 filed on 04/03/1998

US Classes:

704/257, Natural language704/256, Markov704/259Neural network

Examiners

Primary: Hudspeth, David
Assistant: Abebe, Daniel

Attorney, Agent or Firm

International Class

G10L 015/16

Abstract

A method (700), device (1101), and system (1100) provide generalized bidirectional island-driven chart parsing based on congruency checking to prevent edge overgeneration for robust and efficient parsing of a word graph. The method prevents edge overgeneration by selecting, in accordance with a predetermined scheme, a candidate edge with a starting vertex, an ending vertex, a label, and a congruence key for entry in a chart from an agenda of edges, selecting an edge equivalence set in the chart that matches the starting vertex, the ending vertex, and the label of the candidate edge, and entering the candidate edge into the chart if the congruence key of the candidate edge fails to match the congruence key of any edge in the edge equivalence set.

Other References

  • Mellish, Chris, David Allport, Anthony F. Hartley, Roger Evans, Lynne J. Cahill, Robert Gaizauskas, and John Walker. 1992. The TIC message analyser Cognitive Science Research Paper Serial No. CSRP 225, University of Sussex, Brighton, U.K
  • Oerder, Martin, and Hermann Ney. 1993. Word graphs: An efficient interface between continuous-speech recognition and language understanding. ICASSP-93, vol. 2, 119-122
  • Tashiro, Toshihisa, Toshiyuki Takezawa, Tsuyoshi Morimoto, and Masaaki Nagata. 1994. Efficient chart parsing of speech recognition candidates. ICASSP-94, vol. 2, 13-16
  • van Noord, Gertjan. 1997. An efficient implementation of the head-corner parser. Computational Linguistics 23(3): 425-45
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?