- 76 Views
- Uploaded on
- Presentation posted in: General

Ling 570. Day #2 . Tokenizing and evaluating tokenization. Tokenization.

Ling 570

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Ling 570

Day #2

Tokenizing and evaluating tokenization

After coming close to a partial settlement a year ago, shareholders who filed civil suits against Ivan F. Boesky and the partnerships he once controlled again are approaching an accord, people familiar with the case said.

Meanwhile, within the next few weeks, the limited partners in Ivan F. Boesky & Co. L.P. are expected to reach a partial settlement with Drexel Burnham Lambert Inc. regarding the distribution of the $330 million in partnership assets, said one of the individuals.

One individual said the shareholders' accord was "well worked out."

There are at least 27 class-action shareholder suits that have been consolidated in federal court in New York under U.S. District Judge Milton Pollack.

- After coming close to a partial settlement a year ago, shareholders who filed civil suits against Ivan F. Boesky and Co. L.P. Drexel’s plaintiffs’ …

- A Finite-State Automaton (FSA) is a 5-tuple:
- A set of states Q {q0,q1,q2,q3,q4}
- A finite alphabet Σ {b,a,!}
- A start state q0
- A set of accepting states {q4}
- A transition function Q x Σ Q

- An automaton:
- Σ

- An automaton:
- Σ= {a,b}
- Q =

- An automaton:
- Σ= {a,b}
- Q = {q0,q1}; start: ; final:

- An automaton:
- Σ= {a,b}
- Q = {q0,q1}; start: q0; final: {q1}
- Regex=

- An automaton:
- Σ= {a,b}
- Q = {q0,q1}; start: q0; final: {q1}
- Regex= a*b+

- An automaton:
- Σ= {a,b}
- Q = {q0,q1}; start: q0; final: {q1}
- Regex= a*b+

- An automaton:
- Σ= {a,b}
- Q = {q0,q1}; start: q0; final: {q1}
- Regex= a*b+

- An automaton:
- Σ= {a,b}
- Q = {q0,q1}; start: q0; final: {q1}
- Regex= a*b+

- An automaton:
- Σ= {a,b}
- Q = {q0,q1}; start: q0; final: {q1}
- Regex= a*b+

- Another automaton:

- Recognition: An FSA is a model that, given an input string, accepts the string if it is in the language, and rejects otherwise
- Generation: An FSA m is a model that can generate all and only the strings in L(m).

- Finite automaton that maps between two strings
- Automaton with two labels/arc
- input:output

- Automaton with two labels/arc

- Tokenization
- Segmentation

- Morphological analysis
- Transliteration
- Translation
- Speech recognition
- Spoken language understanding

- FST as recognizer:
- Takes pair of input:output strings
- Accepts if in language, o.w. rejects

- FST as recognizer:
- Takes pair of input:output strings
- Accepts if in language, o.w. rejects

- FST as generator:
- Outputs pairs of strings in languages

- FST as recognizer:
- Takes pair of input:output strings
- Accepts if in language, o.w. rejects

- FST as generator:
- Outputs pairs of strings in languages

- FST as translator:
- Reads an input string and prints output string

- FST as recognizer:
- Takes pair of input:output strings
- Accepts if in language, o.w. rejects

- FST as generator:
- Outputs pairs of strings in languages

- FST as translator:
- Reads an input string and prints output string

- FST as set relator:
- Computes relations between sets

FR: ce bill met de le baume sur une blessure

EN: this bill putsbalm on a sore wound

- Case folding:
- He said he said

- Case folding:
- He said he said

- Tokenization:
- “He ran.” “ He ran . “

- Case folding:
- He said he said

- Tokenization:
- “He ran.” “ He ran . “

- POS tagging:
- They can fish PRO VERB NOUN

- Pronunciation:
- B AH T EH R B AH DX EH R

- Morphological generation:
- Fox s Foxes

- Morphological analysis:
- cats cat s

- Next Class: