×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

Dawid Weiss- Finite state automata in lucene

by on Jun 15, 2011

  • 2,803 views

Finite state automata and transducers made it into Lucene fairly recently, but already show a very promising impact on search performance. This data structure is rarely exploited because it is ...

Finite state automata and transducers made it into Lucene fairly recently, but already show a very promising impact on search performance. This data structure is rarely exploited because it is commonly (and unfairly) associated with high complexity. During the talk, I will try to show that automata and transducers are in fact very simple, their construction can be very efficient (memory and time-wise) and their field of applications very broad.

Statistics

Views

Total Views
2,803
Views on SlideShare
2,801
Embed Views
2

Actions

Likes
9
Downloads
42
Comments
0

1 Embed 2

http://a0.twimg.com 2

Accessibility

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

 Dawid Weiss- Finite state automata in lucene Dawid Weiss- Finite state automata in lucene Presentation Transcript