1. Articles in category: Parsing

    577-598 of 598 « 1 2 ... 22 23 24 25
    1. 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
    2. 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
    3. 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
    4. 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
    5. 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
    6. 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
    7. 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
    8. 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
    9. 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
    10. 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
    11. 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
    12. Sense discrimination system and method

      A sense discrimination system and method are described. One aspect of the present invention includes a method for performing sense discrimination, a token stream including a token wherein each sense of each lexical entry may be marked with a positive or negative morphology preference, each sense of each entry may be marked with relevant contexts, and each sense of each entry may be marked with a positive/negative status being provided, at least a portion of one parse tree and at least a portion of one head tail matrix also being provided. The method includes the steps of converting each ...
      Read Full Article
      Mentions: Sun Workstation
    13. Computer method for identifying predicate-argument structures in natural language text

      A computer method is disclosed for determining predicate-argument structures in input prose sentences of English. The input sentence, in the form of a string of words separated by blanks, is first analyzed (parsed) by a rule component that has access only to morphological and syntactic information about the words. The output of this rule component, in the form of a data structure consisting of attribute-value pairs, is then processed by the argument structure component, which consists of a set of partially ordered procedures that incorporate further linguistic knowledge. The output of these procedures is the same attribute-value structure, now enhanced ...
      Read Full Article
    14. Natural language processing system

      A natural language arrangement includes stored grammatical rules each having a phrase structure part representing grammatical functions, a semantic part representing the manner of propagation from a superordinate category to a subordinate category, a condition part, and a message part that imposes limitations on a phrase structure rule using the subordinate category as a superordinate category. The grammatical rules are searched and interpreted to generate a phrase structure for a sentence from grammatical function information obtained by interpreting and applying the searched grammatical rules.
      Read Full Article
    15. Data processing system implemented process and compiling technique for performing context-free parsing algorithm based on register vector grammar

      A context-free parsing algorithm employing register vector grammars provides fast parsing of natural languages. A compiler for register vector grammars accepts input grammars as standard phase structure rules and generates strongly equivalent grammars in register vector grammar form. By applying the context-free register vector grammar parsing algorithm to the resulting grammars, strings may be parsed and trees may be constructed in the same manner performed with phase structure grammar.
      Read Full Article
    16. System and method for parsing natural language by unifying lexical features of words

      A method for parsing for natural languages includes a grammar and a lexicon. A knowledge base may be used to define elements in the lexicon. A processor receives single words input by a user and adds them to a sentence under construction. Valid next words are predicted after each received input word. The preferred system has two major components: a parser and a predictor. The predictor accesses only the lexicon and the knowledge base, if one is used, to determine the valid next input words. The parser constructs sentences which are valid according to the grammar out of words accepted ...
      Read Full Article
    17. System and method for natural language parsing by initiating processing prior to entry of complete sentences

      A system and method for parsing natural language is provided. The system comprises a plurality of computer program code modules which address a plurality of predetermined lookup tables. Strings of characters, such as words, assigned one or more syntactical tags identifying the grammatical roles the strings can play are stored in a dictionary and retrieved as a system user inputs text to be processed. The tags are manipulated by a phrase parsing program module and translated into phrases according to grammatical rules stored in a lookup table. Sequences of the phrases corresponding to input sentences are maniplated by a sentence ...
      Read Full Article
    18. Method and system for language translation

      A machine translation system capable of performing translation at a high processing speed with improved disambiguation rate in the parsing by applying grammar rules in dependence on the domains to which texts to be translated belong, objects of the texts and rules of sentences in the same text. The machine-translation system for translating a first language to a second language uses a grammer memory for storing grammar rules of the first or second language and a main memory for storing a variety of information, wherein the grammar rules stored in the grammar memory are prepared in groups at least on ...
      Read Full Article
      Mentions: Tokyo
    19. Natural language processing system

      A natural language processing system for processing an original text by applying grammar rules, includes a grammar rule control table for holding information on applicability of the grammar rules to the original text, the information containing dictionary information associated with words appearing in the original text, and means for determining application or non-applicability application of each grammar rule based on the applicability information. The application conditions for applying each grammar rule are collectively evaluated or examined based on the information on the applicability of the grammar rules contained in the dictionary information and information on the text type, sentence type ...
      Read Full Article
    20. Method and system for generating lexicon of cooccurrence relations in natural language

      A method and an apparatus for generating/maintaining automatically or interactively a lexicon for storing information of cooccurrence relations utilized for determining whether or not a sequence of words in a given sentence described in a natural language is semantically correct with the aid of a memory, a data processor and a textual sentence file. A hypothesized cooccurrence relation table for storing hypothesized cooccurrence relations each having a high probabliity of being a valid cooccurrence relation is prepared by consulting the file. A hypothesis for the cooccurrence relation is previously established on the basis of a cooccurrence relation pattern indicating ...
      Read Full Article
    21. Natural language understanding system

      A hybrid natural language understanding (NLU) system which is particularly designed for processing natural language text. Primary functional components of the NLU system include a preprocessor; a word look-up and morphology module which communicates with a lexicon and a learning module; a syntactic parser which interfaces with an augmented transition network (ATN) grammar; a case frame applier, which converts the syntactic structure into canonical, semantic "case frames"; and a discourse analysis component which integrates explicit and implied information in the text into a conceptual structure which represents its meaning. This structure may be passed on to a knowledge based system ...
      Read Full Article
    22. Natural-language interface generating system

      A system for interactively generating a natural-language input interface, without any computer-skill programming work being required. The natural-language menu interface thus generated provides a menu-selection technique whereby a totally unskilled computer user, who need not even be able to type, can access a relational or hierarchical database, without any possibility of error. That is, the user addresses commands to the database system simply by selecting words from an appropriate menu of words which could legally follow in commands, so that the user inputs commands which are phrased entirely in English, and these commands cannot be misunderstood by the database system ...
      Read Full Article
    577-598 of 598 « 1 2 ... 22 23 24 25
  1. Categories

    1. Default:

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

  3. Organizations in the News

    1. (1 articles) European Union
    2. (1 articles) Cortana
    3. (1 articles) Google
    4. (1 articles) Stanford Parser
    5. (1 articles) Google Translate
    6. (1 articles) NLP
    7. (1 articles) Part
    8. (1 articles) Google Research
  4. Locations in the News

    1. (1 articles) John
    2. (1 articles) Bayes
    3. (1 articles) Russian
    4. (1 articles) Italy
    5. (1 articles) Siri