CA2419105C - Generation avec grammaires fonctionnelles lexicales - Google Patents

Generation avec grammaires fonctionnelles lexicales Download PDF

Info

Publication number
CA2419105C
CA2419105C CA002419105A CA2419105A CA2419105C CA 2419105 C CA2419105 C CA 2419105C CA 002419105 A CA002419105 A CA 002419105A CA 2419105 A CA2419105 A CA 2419105A CA 2419105 C CA2419105 C CA 2419105C
Authority
CA
Canada
Prior art keywords
facts
fact
edge
guide
computer
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CA002419105A
Other languages
English (en)
Other versions
CA2419105A1 (fr
Inventor
John T. Maxwell, Iii
Hadar Shemtov
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xerox Corp
Original Assignee
Xerox Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US10/260,652 external-priority patent/US7225121B2/en
Priority claimed from US10/256,658 external-priority patent/US7302382B2/en
Application filed by Xerox Corp filed Critical Xerox Corp
Publication of CA2419105A1 publication Critical patent/CA2419105A1/fr
Application granted granted Critical
Publication of CA2419105C publication Critical patent/CA2419105C/fr
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/205—Parsing
    • G06F40/211—Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/279—Recognition of textual entities
    • G06F40/284—Lexical analysis, e.g. tokenisation or collocates
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/40—Processing or translation of natural language
    • G06F40/55—Rule-based translation
    • G06F40/56—Natural language generation

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Machine Translation (AREA)

Abstract

Un procédé de génération avec grammaires reposant sur l'unification, au même titre que les grammaires lexicales-fonctionnelles qui emploient la construction et l'analyse des guides de génération pour repérer des faits internes et éliminer des ensembles incomplets avant de bâtir un tableau de génération. Le guide de génération peut ensuite servir à élaborer un tableau de génération et donc à générer efficacement des grammaires reposant sur l'unification, comme les grammaires lexicales- fonctionnelles. Le guide de génération constitue un exemple de grammaire qui a été spécialisé dès l'entrée et ne contient que les parties de la grammaire qui en relèvent. Quand le guide de génération est analysé en vue de déterminer des faits internes, le tableau de génération produit est plus court.
CA002419105A 2002-02-20 2003-02-13 Generation avec grammaires fonctionnelles lexicales Expired - Fee Related CA2419105C (fr)

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US35917602P 2002-02-20 2002-02-20
US60/359,176 2002-02-20
US10/260,652 US7225121B2 (en) 2002-02-20 2002-09-27 Generating with Lexical Functional Grammars
US10/256,658 US7302382B2 (en) 2002-02-20 2002-09-27 Generating with lexical functional grammars
US10/260,652 2002-09-27
US10/256,658 2002-09-27

Publications (2)

Publication Number Publication Date
CA2419105A1 CA2419105A1 (fr) 2003-08-20
CA2419105C true CA2419105C (fr) 2007-01-09

Family

ID=27739085

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002419105A Expired - Fee Related CA2419105C (fr) 2002-02-20 2003-02-13 Generation avec grammaires fonctionnelles lexicales

Country Status (4)

Country Link
EP (1) EP1341095B1 (fr)
JP (1) JP2003256420A (fr)
CA (1) CA2419105C (fr)
DE (1) DE60327570D1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US12266018B1 (en) 2017-01-16 2025-04-01 Bind Benefits, Inc. Use determination risk coverage datastructure for on-demand and increased efficiency coverage detection and rebalancing apparatuses, processes and systems

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2008292779B2 (en) * 2007-08-31 2012-09-06 Microsoft Technology Licensing, Llc Coreference resolution in an ambiguity-sensitive natural language processing system
US9569425B2 (en) 2013-03-01 2017-02-14 The Software Shop, Inc. Systems and methods for improving the efficiency of syntactic and semantic analysis in automated processes for natural language understanding using traveling features

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US12266018B1 (en) 2017-01-16 2025-04-01 Bind Benefits, Inc. Use determination risk coverage datastructure for on-demand and increased efficiency coverage detection and rebalancing apparatuses, processes and systems

Also Published As

Publication number Publication date
DE60327570D1 (de) 2009-06-25
JP2003256420A (ja) 2003-09-12
EP1341095A1 (fr) 2003-09-03
CA2419105A1 (fr) 2003-08-20
EP1341095B1 (fr) 2009-05-13

Similar Documents

Publication Publication Date Title
US7225121B2 (en) Generating with Lexical Functional Grammars
Moot et al. The logic of categorial grammars: a deductive account of natural language syntax and semantics
US7565281B2 (en) Machine translation
EP0814418B1 (fr) Procédé et dispositif pour unifier des structures de données
US7447623B2 (en) Machine translation
EP1351158A1 (fr) Traduction par machine
Pereira et al. Incremental interpretation
EP1349079A1 (fr) Traduction automatique
Schwitter Specifying and verbalising answer set programs in controlled natural language
CN114444032A (zh) 自定义规则混淆代码的方法及装置
US7302382B2 (en) Generating with lexical functional grammars
CA2419105C (fr) Generation avec grammaires fonctionnelles lexicales
Nerbonne Computational semantics—linguistics and processing
Bouma Lexicons for feature-based systems
Popowich et al. A Logic-Based Implementation of Head-Driven Phrase Structure Grammar.
Li et al. Parsing long English sentences with pattern rules
US12333245B2 (en) Methods and apparatus to improve disambiguation and interpretation in automated text analysis using structured language space and transducers applied on automatons
Butler Analysing Java Identifier Names
McCord Lmt
Menon et al. A new evolutionary parsing algorithm for ltag
Moll et al. Head-corner parsing using typed feature structures
Erbach et al. Visions for logic-based natural language processing
Pulman et al. Grammar learning using inductive logic programming
Harper Squibs and Discussions: Storing Logical Form in a Shared-Packed Forest
Eslick et al. Langutils: A natural language toolkit for common lisp

Legal Events

Date Code Title Description
EEER Examination request
MKLA Lapsed

Effective date: 20210215