1. Articles in category: Parsing

    529-552 of 563 « 1 2 ... 20 21 22 23 24 »
    1. Character recognition method and apparatus

      A character recognition method is arranged to supplement an erroneously recognized character with a linguistic knowledge. In this method, the extraction of a candidate based on the search of a word dictionary occupies a large part of the operation. To speed up the extraction of a candidate word, therefore, the method is provided to search the dictionary by using a group of candidate characters or a dictionary header for processing an inflected form of a verb. Further, the present method is provided for calculating a word matching cost for improving an efficiency of modifying an erroneous recognition. The word search ...
      Read Full Article
    2. Parsing method and system for natural language processing

      The present invention provides a method and system to improve the accuracy of natural language processing systems by enabling them to acquire a parsing output that is accurate to a degree for any type of sentence. The feature of the present invention is that a sentence (a non-grammatical, ill-formed sentence) that cannot be parsed when using a conventional parsing process, which relies on grammatical knowledge, is re-analyzed by using the parsing results for an identical word row in a sentence (a well-formed sentence) in the same context that could be parsed. More specifically, the processing below is performed: (1) a ...
      Read Full Article
    3. Method and system for English text analysis

      A computer-implemented method and system are provided for English text analysis. A file of a plurality of English sentences is received and submitted to a parser. A unified parse structure is generated by the parser for predefined ones of the English sentences. A plurality of predetermined critiquing rules are applied to each of the unified parse structures for identifying exceptions to recommended English. Identified exceptions together with related information are stored in an exception file. Then an interactive session with a user is performed utilizing the stored exception file.
      Read Full Article
    4. Method of parsing unification based grammars using disjunctive lazy copy links

      A method of unifying feature structures using disjunctive lazy copy links. The method begins with unification of two daughter feature structures to generate their mother feature structure. Lazy copy links point from the mother feature structure back to her daughter feature structures. If unification activates any of these lazy copy links, then a selected one of the two daughter feature structures is expanded. Expansion of a disjunctive feature structure may generate a number of alternative feature structures. If so, the alternative feature structures are examined to determine if their number can be reduced by replacing multiple feature structures with one ...
      Read Full Article
    5. Method and device for parsing and analyzing natural language sentences and text

      A program is provided for organizing a natural language, such as English, into binary units of two basic elements, Nounness and Verbness, which combine in two idea word patterns, called Primary Image and Conditional Image, and two Detail word patterns, called Process Detail and Background Detail. These two basic elements, Nounness and Verbness, function binarily within the program, either in combination for the two Image word patterns or separately for the two Detail word patterns. All word terns, except the verb-in-tense in the two Image word patterns, function binarily within the program in one of two positions: as Nounness, called ...
      Read Full Article
    6. Large vocabulary connected speech recognition system and method of language representation using evolutional grammer to represent context free grammars

      A method of recognizing speech input selectively creates and maintains grammar representations of the speech input in essentially real time. Speech input frames are received by a speech recognition system. Grammar representations are created for each speech frame and a probability score is derived for the representations indicating the probability of the accuracy of the representations to the speech input. Representations having a probability score below a predetermined threshold are not maintained. Those grammar representations having probability scores above the predetermined threshold are maintained. As more speech frames are received by the system, additional grammar representations are created and the ...
      Read Full Article
    7. Large vocabulary connected speech recognition system and method of language representation using evolutional grammar to represent context free grammars

      A method of recognizing speech input selectively creates and maintains grammar representations of the speech input in essentially real time. Speech input frames received by a speech recognition system. Grammar representations are created for each speech frame and a probability score is derived for the representations indicating the probability of the accuracy of the representations to the speech input. Representations having a probability score below a predetermined threshold are not maintained. Those grammar representations having probability scores above predetermined threshold are maintained. As more speech frames are received by the system, additional grammar representations are created and the probability scores ...
      Read Full Article
    8. Machine translation system utilizing bilingual equivalence statements

      A machine translation system which operates by analyzing a source text to deduce information about the usage and meaning of the words of a source language text as they occur in context. This information is passed to an equivalencing module, which determines a set of equivalent target language words from which may be constructed a target language text by a generation module. The generation module has internal structure, including a tree construction module and a constraint checking module. The two modules operate in parallel. The tree constructor builds legal target language structures from which the translated text may be extracted ...
      Read Full Article
    9. Parsing system

      A subject-of-analysis input section inputs an input sentence or phrase to be analyzed. A dictionary unit holds dictionary data for dictionary consultation for a language of the input sentence. A morphemic analyzer consults the dictionary for the input sentence and recognizes breaks between every input word. A grammatical rule unit holds grammatical rules for parsing in the form of a general context-free grammar. A parsing unit applies the grammatical rules to the input sentence for parsing of the sentence. An analysis table unit stores the analysis intermediate results by the parsing unit in predetermined storage locations and holds an analysis ...
      Read Full Article
    10. System for recognizing sentence patterns and a system recognizing sentence patterns and grammatical cases

      A slot table contains (1) all possible sentence patterns (VPs), arranged in rows, which a predicate in an input sentence can take, and (2) arguments of the VPs expressed as slot conditions in slots positioned in a finite number of positions. A grammatical case pattern table contains columns corresponding to respective grammatical cases of the basic patterns arranged in the order in which the cases appear in a basic pattern before shifting; all the grammatical case patterns are expressed as binary values representing existing/non-existing ones of the respective grammatical cases in respective rows corresponding to the grammatical case patterns ...
      Read Full Article
    11. Robust language processor for segmenting and parsing-language containing multiple instructions

      Apparatus and method are provided for segmenting, parsing, interpreting and formatting the content of instructions such as air traffic control instructions. Output from a speech recognizer is so processed to produce such instructions in a structured format such as for input to other software. There are two main components: an instruction segmenter and a robust parser. In the instruction segmenter, the recognized text produced by the speech recognizer is segmented into independent instructions and each instruction is processed. The instruction segmenter receives a recognized air traffic control or other instruction, and segments it into individual commands. Utterances or other language ...
      Read Full Article
    12. Archiving and retrieving multimedia objects using structured indexes

      To archive information, a phrase or sentence describing the information, typically expressed in a natural language and conforming to the rules of a grammar (like a natural language grammar) is used to create a structured index which also conforms to the natural language grammar. The structured index has structure because the words in the index have a function and a relationship among each other as determined by the grammar. The index is combined with a location pointer of information to be cataloged, preferably multimedia information, to form a matched pair, i.e., a structured index and a segment (or a ...
      Read Full Article
    13. Associative memory processing method for natural language parsing and pattern recognition

      An associative memory processor architecture is disclosed for the fast and efficient execution of parsing algorithms for natural language processing and pattern recognition applications. The architecture consists of an associative memory unit for the storage of parsing state representations, a random access memory unit for the storage of the grammatical rules and other tables according to which the parsing is done, a finite state parsing control unit which embodies the chosen parsing algorithm, and a communications unit for communication with a host processor or external interface. The use of associative memory for the storage of parsing state representations allows the ...
      Read Full Article
    14. Contextual tagger utilizing deterministic finite state transducer

      A system for assigning part-of-speech tags to English text includes an improved contextual tagger which utilizes a deterministic finite state transducer to improve tagging speed such that large documents can have its sentences accurately tagged as to parts of speech to permit fast grammar checking, spell checking, information retrieval, text indexing and optical character recognition. The subject system performs by first acquiring a set of rules by examining a training corpus of tagged text. Then, these rules are transformed into a deterministic finite-state transducer through the utilization of non-deterministic transducers, a composer and a determiniser. In order to tag an ...
      Read Full Article
    15. Text editing apparatus for rearranging sentences

      The present invention provides a text editing support apparatus in which constituents of text and connective relationships among the constituents are received as inputs. The constituents and the connective relationships among the constituents are held within the apparatus, along with rules on the connective relationships among the constituents. The connection rules are applied to the held constituents to form text. The result of text formation obtained by applying the connection rules is displayed.
      Read Full Article
      Mentions: Fuji Xerox
    16. Artificial intelligence language program

      A sentence entered by a user is translated into Esperanto. The translated sentence is then parsed and a series of propositions are generated. Each proposition consist of a subject, verb, and an optional object such as an adjective, noun, or prepositional phrase, if present. A series of propositional databases are used to relate the various propositions as to their function within the sentence, thereby mapping the thought of the sentence in a form recognizable by a machine.
      Read Full Article
      Mentions: Esperanto
    17. Apparatus and method for syntactic signal analysis

      An apparatus and method for syntactic signal analysis which is suitable for processing signals which deviate, within a freely selected margin, from a set of signals predetermined by a grammar, the apparatus being provided with a feature unification mechanism which detects violations of features, and an adaptive threshold mechanism coupled thereto. The feature unification mechanism, which processes the features in groups so that rapid processing is obtained, determines a violation score, thus providing a measure of the deviation of the analyzed signal from the set of signals predetermined by the grammar and indicates what elements of the signal are not ...
      Read Full Article
    18. Associative memory processor architecture for the efficient execution of parsing algorithms for natural language processing and pattern recognition

      An associative memory processor architecture is disclosed for the fast and efficient execution of parsing algorithms for natural language processing and pattern recognition applications. The architecture consists of an associative memory unit for the storage of parsing state representations, a random access memory unit for the storage of the grammatical rules and other tables according to which the parsing is done, a finite state parsing control unit which embodies the chosen parsing algorithm, and a communications unit for communication with a host processor or external interface. The use of associative memory for the storage of parsing state representations allows the ...
      Read Full Article
    19. System for recognizing sentence patterns and a system for recognizing sentence patterns and grammatical cases

      A slot table contains (1) all possible sentence patterns (VPs), arranged in rows, which a predicate in an input sentence can take, and (2) arguments of the VPs expressed as slot conditions in slots positioned in a finite number of positions. A grammatical case pattern table contains columns corresponding to respective grammatical cases of the basic patterns arranged in the order in which the cases appear in a basic pattern before shifting; all the grammatical case patterns are expressed as binary values representing existing/non-existing ones of the respective grammatical cases in respective rows corresponding to the grammatical case patterns ...
      Read Full Article
    20. Multiple score language processing system

      A language processing system includes a mechanism for measuring the syntax trees of sentences of material to be translated and a mechanism for truncating syntax trees in response to the measuring mechanism. In a particular embodiment, a Score Function is provided for disambiguating or truncating ambiguities on the basis of composite scores, generated at different stages of the processing.
      Read Full Article
    21. Constrained natural language interface for a computer system

      A user/computer interface is described that employ a constrained natural language-form input. The computer employs a feedback method to reinforce a user's confidence and knowledge that the computer comprehends a query or instruction. The user interface initially parses a user's natural language-form input into a case frame. The case frame is then filtered into a goal-expression that comprises a verb and remaining syntactical portions of the input query/instruction. The system then paraphrases the goal-expression into constrained natural language-form and communicates the paraphrase to the user for confirmation that the computer system has correctly interpreted the user ...
      Read Full Article
    22. System and method for converting sentence elements unrecognizable by a computer system into base language elements recognizable by the computer system

      A system and method for converting inoperative sentence elements into operative elements in which a set of grammar rules for substituting sentence elements with different elements is established. A sequential comparison between each grammar rule and the sentence elements is then accomplished to find a match between a grammar rule and one or more contiguous sentence elements. A substitution of the matched element for the different elements from the grammar rule is then accomplished. Such sequential comparison and substitution is continued for the entire series of sentence elements to fully convert the sentence to operative elements.
      Read Full Article
    23. Natural language processing system and method for parsing a plurality of input symbol sequences into syntactically or pragmatically correct word messages

      A Natural Language Processing System utilizes a symbol parsing layer in combination with an intelligent word parsing layer to produce a syntactically or pragmatically correct output sentence or other word message. Initially, a plurality of polysemic symbol sequences are input through a keyboard segmented into a plurality of semantic, syntactic, or pragmatic segments including agent, action and patient segments, for example. One polysemic symbol sequence, including a plurality of polysemic symbols, is input from each of the three segments of the keyboard. A symbol parsing device, in a symbol parsing layer, then parses each of the plurality of symbols in ...
      Read Full Article
    24. Molecular natural language processing system

      A natural language processing system for processing digitally encoded text by utilizing a "molecular" method. This method combines words into sentences like atoms combine to form molecules. Each word in the language is treated like an atom which has particular attributes and binding characteristics. By verifying if these binding characteristics have been satisfied, it can be determined if a set of words can follow each other to form sentences of the language.
      Read Full Article
      Mentions: Russian
    529-552 of 563 « 1 2 ... 20 21 22 23 24 »
  1. Categories

    1. Default:

      Discourse, Entailment, Machine Translation, NER, Parsing, Segmentation, Semantic, Sentiment, Summarization, WSD
  2. Popular Articles