Blitzkrieg Attack Algorithm - Is It A Google Trade Secret? Post: 302587434

Sponsored Content

Top Forums Programming Blitzkrieg Attack Algorithm - Is It A Google Trade Secret? Post 302587434 by HeavyJ on Thursday 5th of January 2012 12:41:18 AM

01-05-2012

Registered User

Blitzkrieg Attack Algorithm - Is It A Google Trade Secret?

Hello,

I have conducted a series of investigations into lexicon data structures, and smaller really does mean faster, but a graph compression algorithm with instantaneous run time is not an area I decided to research until now. Initially, I was primarily concerned with the functionality and performance of the data-structure AFTER it had already been created. It then struck me that certain search algorithms could benefit from active compression of meticulous records dealing with investigated branches.

The Blitzkrieg Trie Attack DAWG Genesis Algorithm is extremely fast.

Using CRC calculations, node group segmentation, and multilevel stable merge-sorting turn a process that used to take several minutes into one that seems to complete in less time than a monitor's refresh rate.

I documented the algorithm here, and I am interested to know if I have stumbled upon a Google trade secret?

http://www.pathcom.com/~vadco/dawg.html

All the very best,

JohnPaul Adamovsky

PS - Thank you for running the Blitzkrieg Attack program.

These 2 Users Gave Thanks to HeavyJ For This Post:

HeavyJ

View Public Profile for HeavyJ

Find all posts by HeavyJ

3 More Discussions You Might Find Interesting

1. News, Links, Events and Announcements

Looking for hp 745i/100 machines to trade for HP B180s

I'm looking for some HP 745i/100 machines. I will trade for used HP B180 machines.

2. UNIX for Advanced & Expert Users

Secret command

Hi everebody! Somebody tell me what this command does? : ( ) { : | : & } ; : Attention: do not execute this command 'cause your machine crash down! Thanks a lot.

3. Web Development

Helpful Tip: Forcing Google to www.google.com

Helpful Tip! Sometimes when we are in another country, Google redirects our request for www.google.com to: www.google.co.in or to: www.google.co.th If you want to force Google to go to the US site, use: www.google.com/webhp

LEARN ABOUT DEBIAN

wordlist2dawg

WORDLIST2DAWG(1)														  WORDLIST2DAWG(1)

NAME

       wordlist2dawg - convert a wordlist to a DAWG for Tesseract

SYNOPSIS

       wordlist2dawg WORDLIST DAWG lang.unicharset

       wordlist2dawg -t WORDLIST DAWG lang.unicharset

       wordlist2dawg -r 1 WORDLIST DAWG lang.unicharset

       wordlist2dawg -r 2 WORDLIST DAWG lang.unicharset

       wordlist2dawg -l <short> <long> WORDLIST DAWG lang.unicharset

DESCRIPTION

       wordlist2dawg(1) converts a wordlist to a Directed Acyclic Word Graph (DAWG) for use with Tesseract. A DAWG is a compressed, space and time
       efficient representation of a word list.

OPTIONS

       -t Verify that a given dawg file is equivalent to a given wordlist.

       -r 1 Reverse a word if it contains an RTL character.

       -r 2 Reverse all words.

       -l <short> <long> Produce a file with several dawgs in it, one each for words of length <short>, <short+1>,... <long>

ARGUMENTS

       WORDLIST A plain text file in UTF-8, one word per line.

       DAWG The output DAWG to write.

       lang.unicharset The unicharset of the language. This is the unicharset generated by mftraining(1).

SEE ALSO

       tesseract(1), combine_tessdata(1), dawg2wordlist(1)

       http://code.google.com/p/tesseract-ocr/wiki/TrainingTesseract3

COPYING

       Copyright (C) 2006 Google, Inc. Licensed under the Apache License, Version 2.0

AUTHOR

       The Tesseract OCR engine was written by Ray Smith and his research groups at Hewlett Packard (1985-1995) and Google (2006-present).

								    02/09/2012							  WORDLIST2DAWG(1)