Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Structural Disambiguation Method using Extraction of Unknown Words from an Example-Base

IP.com Disclosure Number: IPCOM000116214D
Original Publication Date: 1995-Aug-01
Included in the Prior Art Database: 2005-Mar-30
Document File: 2 page(s) / 61K

Publishing Venue

IBM

Related People

Uramoto, N: AUTHOR

Abstract

Disclosed is a system that disambiguate attachment ambiguities in sentences using example-base. Conventional example-based disambiguation system cannot provide information for disambiguation when the word that does not appear in an example-base or a thesaurus. This system can find links to words in the example-base can be inferred by comparing the usage of the word in the text and that of words in the example-base.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Structural Disambiguation Method using Extraction of Unknown Words
from an Example-Base

      Disclosed is a system that disambiguate attachment ambiguities
in sentences using example-base.  Conventional example-based
disambiguation system cannot provide information for disambiguation
when the word that does not appear in an example-base or a thesaurus.
This system can find links to words in the example-base can be
inferred by comparing the usage of the word in the text and that of
words in the example-base.

Suppose the prepositional phase attachment ambiguity in S1 is
resolved.
  (S1) "The system can store a new program in the repository"

      There are two candidates for the attachment of the
prepositional phrase "in the repository".  They are represented by
the following head-modifier relationship:
  (R1) ("store+V" (PP "in") "repository+N")
  (R2) ("program+N" (PP "in") "repository+N")

      In R1 the noun "repository" modifies the verb "store" with
"in," while in R2, it modifies the noun "program".  Conventional
example-based system resolves the ambiguity by searching similar
examples in the example-base.  For example, if there is a same
example
as R1 or R2 in it, the examples are preferred.  Otherwise, thesaurus
is
used to calculate the similarity between the candidates and examples.

      However, if the word in the sentence cannot appear in the
example-base and thesaurus, conventional calculation of similarity
cannot work.  Disclosed method resolves attachment ambiguity
including unkn...