Search

Lauri J Karttunen

from Emerald Hills, CA
Age ~83
Get Report
Also known as:
Laurie Karttunen, Lauri Kartunen
Phone and address:
3950 Jefferson Ave, Redwood City, CA 94062
(650) 363-8070
Related to:
Frances Esther Karttunen, 82Katie L Griffin, 60James W Ayres, 57Suvi K Aika, 56Jaana T Karttunen, 59
Connected to:
Cynthia K Karttunen, 62Heidi Karttunen, 58Krystal A Kartune, 40Josh Kartus, 40Marcus Karty, 60Ruth A Karty, 77Lisa K Kartz, 66Vicky L Kartz, 68Rachel J Karu, 57

Lauri Karttunen Phones & Addresses

  • 3950 Jefferson Ave, Emerald Hills, CA 94062 (650) 363-8070 (650) 364-7639
  • Redwood City, CA
  • Menlo Park, CA
  • Philadelphia, PA
  • Tuscumbia, MO

Resumes

Resumes

Lauri Karttunen Photo 1

Adjunct Professor

View page
Location:
3950 Jefferson Ave, Redwood City, CA 94062
Industry:
Research
Work:
Stanford University Department of Linguistics 1985 - 2008
Consulting Professor
Xerox 1994 - 2000
Principal Scientist
Parc 1984 - Apr 1987
Research Fellow
Sri International 1984 - 1987
Senior Research Linguist
Stanford University 1984 - 1987
Adjunct Professor
Education:
Indiana University Bloomington 1964 - 1969
Doctorates, Doctor of Philosophy, Linguistics Aleksanteri Institute, University of Helsinki 1960 - 1963
Bachelors, Bachelor of Arts, Finnish Language, Finnish, Psychology University of Indiana at Bloomington
Doctorates, Doctor of Philosophy, Linguistics
Skills:
Natural Language Processing
Computational Linguistics
Linguistics
Semantics
Text Mining
Text Analytics
Semantic Technologies
Knowledge Representation
Morphology
Interests:
Boating
Christianity
Cooking
Exercise
Investing
Traveling
Outdoors
Electronics
Home Improvement
International Traavel
Reading
Music
Sports
Family Values
Travel
Movies
Languages:
English
Finnish
Lauri Karttunen Photo 2

Consulting Professor At Stanford University

View page
Position:
Consulting Professor at Stanford University
Location:
San Francisco Bay Area
Industry:
Computer Software
Work:
Stanford University - Center for the Study of Language and Information since Oct 2011
Consulting Professor
Palo Alto Research Center 2001 - 2011
Research Fellow
Palo Alto Reseach Center (PARC) 2001 - 2011
Research Fellow
Palo Alto Research Center (PARC) 1987 - 2011
Research Fellow
Xerox Research Center Europe 1994 - 2000
Research Fellow
Education:
Indiana University Bloomington 1964 - 1969
Ph.D., Linguistics
Languages:
English, Finnish

Publications

Us Patents

Method And Apparatus For Constructing Finite-State Networks Modeling Non-Concatenative Processes

View page
US Patent:
7010476, Mar 7, 2006
Filed:
Dec 18, 2000
Appl. No.:
09/737942
Inventors:
Lauri J Karttunen - Redwood City CA, US
Kenneth R Beesley - Meylan, FR
Assignee:
Xerox Corporation - Stamford CT
International Classification:
G06F 17/20
G06F 17/27
US Classification:
704 1, 704 9
Abstract:
A system constructs finite-state networks. The system initially compiles an intermediate finite-state network from a source file of regular expressions. The intermediate finite-state network includes a delimited subpath that defines a substring having the form of a regular expression. The system subsequently produces an output finite-state network in which the delimited subpath is replaced with an FSN compiled from the substring encoded by the delimited subpath.

Region-Matching Transducers For Natural Language Processing

View page
US Patent:
8447588, May 21, 2013
Filed:
Dec 18, 2008
Appl. No.:
12/338058
Inventors:
Lauri J Karttunen - Emerald Hills CA, US
Assignee:
Palo Alto Research Center Incorporated - Palo Alto CA
International Classification:
G06F 17/20
G06F 17/28
G06F 17/27
US Classification:
704 9, 704 4, 704 1, 704251
Abstract:
Computer methods, apparatus and articles of manufacture therefor, are disclosed for developing a region-matching transducer for marking language data having delimited strings. The region-matching transducer defines one or more patterns of one or more sequences of delimited strings, with at least one of the patterns defined in the region-matching transducer having an arrangement of a plurality of class-matching networks. The plurality of class-matching networks defines a combination of two or more entity classes from one or both of part-of-speech classes and application-specific classes. The region-matching transducer has, for each of the one or more patterns, an arc that leads from a penultimate state with a transition label that identifies the entity class of the pattern, and shares states between patterns leading to a penultimate state when segments of delimited strings making up two or more patterns overlap.

Region-Matching Transducers For Text-Characterization

View page
US Patent:
8510097, Aug 13, 2013
Filed:
Dec 18, 2008
Appl. No.:
12/338085
Inventors:
Lauri J Karttunen - Emerald Hills CA, US
Ji Fang - Mountain View CA, US
Assignee:
Palo Alto Research Center Incorporated - Palo Alto CA
International Classification:
G06F 17/20
G06F 17/28
G10L 15/04
US Classification:
704 9, 704 1, 704 2, 704 3, 704 4, 704 5, 704 6, 704 7, 704 8, 704251, 704252
Abstract:
Computer methods, apparatus and articles of manufacture therefor, are disclosed for text-characterization using a finite state transducer that along each path accepts on a first side an n-gram of text-characterization (e. g. , a language or a topic) and outputs on a second side a sequence of symbols identifying one or more text-characterizations from a set of text-characterizations. The finite state transducer is applied to input data. For each n-gram accepted by the finite state transducer, a frequency counter associated with the n-gram of the one or more text-characterizations in the set of text-characterizations is incremented. The input data is classified as one or more text-characterizations from the set of text-characterizations using the frequency counters associated therewith.

System And Method For Generating, Updating, And Using Meaningful Tags

View page
US Patent:
20130159306, Jun 20, 2013
Filed:
Dec 19, 2011
Appl. No.:
13/330488
Inventors:
Lauri J. Karttunen - Emerald Hills CA, US
Assignee:
PALO ALTO RESEARCH CENTER INCORPORATED - Palo Alto CA
International Classification:
G06F 17/30
G06F 7/00
US Classification:
707737, 707736, 707741, 707780, 707E17008
Abstract:
A system and method for generating tag glossaries and use thereof is provided. A set of tags is accessed. Each tag is associated with a glossary that includes one or more terms and definitions for the terms. A new tag is generated and a new glossary is generated for the new tag based on the glossaries associated with the set of tags. The tag glossaries can be used to provide context for documents associated with the tags, to determine appropriate tags for untagged documents, to help in search for other documents, and to build indices for documents or collections of documents.

Finite-State Transduction Of Related Word Forms For Text Indexing And Retrieval

View page
US Patent:
55946410, Jan 14, 1997
Filed:
Jun 8, 1994
Appl. No.:
8/255504
Inventors:
Ronald M. Kaplan - Palo Alto CA
Lauri Karttunen - Redwood City CA
Assignee:
Xerox Corporation - Stamford CT
International Classification:
G06F 1730
US Classification:
395601
Abstract:
The present invention solves a number of problems in using stems (canonical indicators of word meanings) in full-text retrieval of natural language documents, and thus permits recall to be improved without sacrificing precision. It uses various arrangements of finite-state transducers to accurately encode a number of desirable ways of mapping back and forth between words and stems, taking into account both systematic aspects of a language's morphological rule system and also the word-by-word irregularities that also occur. The techniques described apply generally across the languages of the world and are not just limited to simple suffixing languages like English. Although the resulting transducers can have many states and transitions or arcs, they can be compacted by finite-state compression algorithms so that they can be used effectively in resource-limited applications. The invention contemplates the information retrieval system comprising the novel finite state transducer as a database and a processor for responding to user queries, for searching the database, and for outputting proper responses, if they exist, as well as the novel database used in such a system and methods for constructing the novel database.

Augmenting A Lexical Transducer By Analogy

View page
US Patent:
54125677, May 2, 1995
Filed:
Dec 31, 1992
Appl. No.:
7/999736
Inventors:
Lauri Karttunen - Redwood City CA
Assignee:
Xerox Corporation - Rochester NY
International Classification:
G06F 1538
US Classification:
36441919
Abstract:
A method and apparatus for adding a word to a lexical transducer in a computer system. The invention allows a user of the computer system to specify a word to be added to the lexical transducer database. The lexical transducer represents words as ordered sequences of symbols, i. e. , characters and morphological tags. "Upper" and "lower" symbols are associated with arcs. The arcs join states and form a path. Each path determines an upper and lower sequence of ordered symbols. The upper sequence of symbols represents a base form of a word and the lower sequence of symbols represents a surface form of the same word. The user adds a word to the lexical transducer by specifying a "model" word already existing in the lexical transducer, along with a new word that has surface forms analogous to the model word. The new word is added to the lexical transducer by sharing, as much as possible, the existing arcs of the path of the model word.

Context-Sensitive Method Of Finding Information About A Word In An Electronic Dictionary

View page
US Patent:
56425228, Jun 24, 1997
Filed:
Feb 28, 1995
Appl. No.:
8/396286
Inventors:
Annie E. Zaenen - Redwood City CA
Lauri J. Karttunen - Redwood City CA
Assignee:
Xerox Corporation - Stamford CT
International Classification:
G06F 1727
US Classification:
395794
Abstract:
A technique of using an electronic dictionary in conjunction with electronically-encoded running text that gives the user the most relevant information rather than belaboring the user with all possible information about a selected word. The technique maps the selected word from its inflected form to its citation form, analyzes the selected word in the context of neighboring and surrounding words to resolve ambiguities, and displays the information that is determined to be the most likely to be relevant. The dictionary preferably has information about multi-word combinations that include the selected word, and the context determination typically entails checking whether the selected word is part of a predefined multi-word combination.

Finite-State Encoding System For Hyphenation Rules

View page
US Patent:
57376212, Apr 7, 1998
Filed:
Jun 6, 1995
Appl. No.:
8/469173
Inventors:
Ronald M. Kaplan - Palo Alto CA
Lauri J. Karttunen - Redwood City CA
Assignee:
Xerox Corporation - Rochester NY
International Classification:
G06F 1720
US Classification:
395793
Abstract:
Valid positions for hyphens in input strings are determined by reading in and processing the symbols of the input string through a finite state transducer which has a state-transition data structure determined by a compilation of a set of hyphenation rules. The output of the encoding system can include a hyphenated string, or can accept a hyphenated string and output an indication of whether the input hyphenation is proper according to the set of hyphenation rules.

Wikipedia References

Lauri Karttunen Photo 3

Lauri Karttunen

About:
Born:

1941

Work:

Lauri Karttunen " Lauri Karttunen " is a Consulting Professor in Linguistics at Stanford and an ACL Fellow
Commercial versions of the finite-state technology developed by Karttunen and his colleagues at Palo Alto Research Center and [ http: www....

Education:
Academic degree:

Professor

Area of science:

Semantics • Phonology • Morphology

Humanities:

Computational linguistics

Skills & Activities:
Sport:

Questions

Skill:

Software • SAP

Award:

THE Award • Lifetime Achievement Award

Isbn (Books And Publications)

Natural Language Parsing: Psychological, Computational, And Theoretical Perspectives

View page
Author

Lauri Karttunen

ISBN #

0521023106

Natural Language Parsing: Psychological, Computational, and Theoretical Perspectives

View page
Author

Lauri Karttunen

ISBN #

0521262038

Control profile
Lauri J Karttunen from Emerald Hills, CA, age ~83 Get Report