Patent
Natural language parser
Salah Ait-Mokhtar,Jean-Pierre Chanod,Claude Roux +2 more
- 10 Oct 2002
137
TL;DR: In this paper, the parser applies a plurality of rules which describe syntactic properties of the language of the input strings, and all rules are applied according to a predefined order to the input string.
read more
Abstract: The present invention provides a method and a parser for syntactically analyzing an input string. The parser applies a plurality of rules which describe syntactic properties of the language of the input strings. The plurality of rules comprise two types of rules. A first type of rules comprises immediate dominance rules and linear precedence rules. A second type of rules being sequence rules. All rules of the plurality of rules are applied according to a predefined order to the input string. This new incremental parsing architecture has advantages with respect to grammar engineering and allows a more efficient parsing.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Linguistic user interface
Frédérique Segond,Claude Roux +1 more
- 27 Jan 2006
TL;DR: A system for retrieval of text includes a processor which identifies grammar rules associated with text fragments of a text string that is retrieved from an associated storage medium, and retrieves text strings from the storage medium which satisfy the grammar rules as mentioned in this paper.
221
Patent
Semantic compatibility checking for automatic correction and discovery of named entities
Caroline Brun,Caroline Hagège +1 more
- 08 Feb 2008
TL;DR: In this article, a computer implemented system and method for processing text are disclosed, in which named entities have been extracted by a standard named entity system, and partially processed text is processed to identify attributive relations between a named entity or proper noun and a corresponding attribute.
186
Patent
Event extraction system for electronic messages
Xavier Tannier,Claude Roux +1 more
- 12 Mar 2008
TL;DR: In this article, a calendar entry generation module generates a candidate calendar entry based on an extracted temporal expression and presents it to a user for consideration as calendar entry, allowing a user to ignore the candidate entry or to accept it.
154
Patent
Systems and methods for analyzing performance of an entity
Daniel Erenrich,Anirvan Mukherjee,William Dwyer +2 more
- 15 Dec 2014
TL;DR: In this article, the authors presented a method for analyzing entity performance that includes receiving data associated with a geographic region and transforming the received data into an object model and then applying a prediction model to the plurality of sub-geographic regions using the object model to determine a predicted performance for at least one entity of a plurality of entities.
131
Patent
Real-time query suggestion in a troubleshooting context
Frederic Roulland,Stefania Castellani,Aaron Kaplan,Maria Antonietta Grasso,Jacki O'Neill,Jonina Selin +5 more
- 19 Oct 2007
TL;DR: In this paper, a method for assisting a user to develop a query in natural language includes receiving a user's query in a natural language and presenting a subset of ranked query suggestions to the user as candidates for user queries.
111
References
An efficient context-free parsing algorithm
TL;DR: In this article, a parsing algorithm which seems to be the most efficient general context-free algorithm known is described, which is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm.
Parsing By Chunks
Steven Abney
- 01 Jan 1991
TL;DR: The typical chunk consists of a single content word surrounded by a constellation of function words, matching a fixed template, and the relationships between chunks are mediated more by lexical selection than by rigid templates.
Partial parsing via finite-state cascades
TL;DR: Deterministic parsers specified by finite state cascades may be more accurate than exhaustive search stochastic context free parsers and extended at modest cost to construct parse trees with finite feature structures.
Talking about trees
Patrick Blackburn,Claire Gardent,Wilfried Meyer-Viol +2 more
- 21 Apr 1993
TL;DR: The motivation for introducing these languages is to provide tools for formalising grammatical frameworks perspicuously, and the paper illustrates this by showing how the leading ideas of GPSG can be captured in LT (LF).
74
Subject and Object Dependency Extraction Using Finite-State Transducers
Salah Ait-Mokhtar,Jean-Pierre Chanod +1 more
- 01 Jan 1997
TL;DR: An approach for fast automatic recognition and extraction of subject and object dependency relations from large French corpora, using a sequence of finite-state transducers, and the impact of POS tagging errors on subject/object dependency extraction is evaluated.
70
Related Papers (5)
Steve Gardner
- 24 Mar 2003
Tassanee K. Supakkul,Janki Y. Vora +1 more
- 20 Apr 2010
Akash Jain,Robert J Mcgrew,Nathan Gettings +2 more
- 20 Nov 2007
Frédérique Segond,Claude Roux +1 more
- 27 Jan 2006