// The Dial-a-Phrase JavaScript Program // (C)Stephen Battey, February 2004 // This software may not be copied or used without permission from the author. // The KeySets Array // - a series of maps from digits to alphabetical characters // - the value at index 10 is a Boolean indicating if the key set is editable // - the string at index 11 is the name of the key set var KeySets = new Array(); KeySets[0] = new Array( " 0", "1.", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz", true, "Custom" ); KeySets[1] = new Array( " ", " ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz", false, "ITU Standard E.161" ); KeySets[2] = new Array( "oq", " ", "abc", "def", "ghi", "jkl", "mn", "prs", "tuv", "wxy", false, "UK Classic" ); KeySets[3] = new Array( " ", " ", "abc", "def", "ghi", "jkl", "mno", "prs", "tuv", "wxy", false, "North American Classic" ); KeySets[4] = new Array( " ", "qz", "abc", "def", "ghi", "jkl", "mno", "prs", "tuv", "wxy", false, "Australia (Former Austel Standard)" ); KeySets[5] = new Array( "oqz", " ", "abc", "def", "ghi", "jkl", "mn", "prs", "tuv", "wxy", false, "Mobile Phone Keypad 1" ); KeySets[6] = new Array( " ", "abc", "def", "ghi", "jkl", "mno", "pqr", "stu", "uvw", "xyz", false, "Mobile Phone Keypad 11" ); KeySets[7] = new Array( " ", "abc", "def", "ghi", "jkl", "mno", "pqr", "stu", "vwx", "yz", false, "Mobile Phone Keypad 111" ); function copyKeySets( srcSets, destSets ) { // loop through each key set var srcSet; var destSet; for (var set=0; set -1) { // extract digit being dealt with, the character last used to take the place of this digit // and the index of that character within the key set digit = TelephoneNumber[digitIndex]; keyMap = KeySetInUse[digit]; lastChar = CurrentPhrase.substring( digitIndex, (digitIndex+1) ); lastCharIndex = keyMap.indexOf( lastChar ); // are there any more characters that can replace this digit? nextCharIndex = lastCharIndex + 1; if (nextCharIndex < keyMap.length) { // replace this character with another that can be tried and then continue processing CurrentPhrase = CurrentPhrase.substring( 0, digitIndex ) + keyMap.substring( nextCharIndex, (nextCharIndex+1) ); break; } else // go back and remove another character from the current phrase digitIndex --; } // check if all search routes have been explored if ( (digitIndex == -1) && (ProcessStep != 0) ) { ProcessTimer = window.setTimeout( "start_ranking()", ProcessPeriod ); } else { // add characters for the remaining digits digitIndex ++; while (digitIndex < TelephoneNumber.length) { digit = TelephoneNumber[digitIndex]; keyMap = KeySetInUse[digit]; CurrentPhrase += keyMap.substring( 0, 1 ); digitIndex ++; } // add the phrase to the list PhraseList[PhraseList.length] = new Phrase( CurrentPhrase ); // update progress meter and call for another search ProcessStep ++; ProcessProgress += ProcessProgressInc; ProcessProgressBar.set_progress( ProcessProgress ); ProcessTimer = window.setTimeout( "search_phrases_background()", ProcessPeriod ); } } // The search algorithm in recursive format. // Much simpler than the call-back routine, but no good for background running in JavaScript. function search_phrases( keySet, telNum, digitIndex ) { // check if we have processed all digits in the telephone number var strLen = telNum.length; if (digitIndex >= strLen) { // add phrase to list and return back-up the call stack PhraseList[PhraseList.length] = new Phrase( CurrentPhrase ); return; } // extract this digit var digit = parseInt( telNum.substring( digitIndex, (digitIndex+1) ) ); // convert to possible characters var charSet = keySet[digit]; for (var i=0; i 1) { // lookup oddity of the first pair of characters oddityCount += oddity_ranking( firstAdjLttrStat, phraseText.substring( 0, 1 ), phraseText.substring( 1, 2 ) ); // run through the phrase and extract each pair of adjacent characters var thisChar = phraseText.substring( 1, 2 ); var prevChar; for (var charI=2; charI<(phraseTextLen-1); charI++) { prevChar = thisChar; thisChar = phraseText.substring( charI, charI+1 ); // lookup oddity of this internal pair of characters oddityCount += oddity_ranking( internAdjLttrStat, prevChar, thisChar ); } // lookup oddity of the last pair of characters oddityCount += oddity_ranking( lastAdjLttrStat, phraseText.substring( phraseTextLen-2, phraseTextLen-1 ), phraseText.substring( phraseTextLen-1, phraseTextLen ) ); } // assign the ranking to this phrase (add 1 to ensure the range of the ranking system is "1 ...") phrase.rank = 1 + oddityCount; } function oddity_ranking( rankingMap, leftChar, rightChar ) { var oddityMapping = rankingMap[leftChar]; if (typeof( oddityMapping ) == "undefined") // this character does not have an entry in the oddity mapping return VERY_ODD; // find the oddity rank for this character compared to the previous character for (var searchI=0; searchI -1) return searchI; } // no oddity mapping was found for this character, assume it to be very odd return VERY_ODD; } // The Phrase Sorting Functionality // - sorts a list of phrases in preferrential order function sort_phrases_by_rank_background() { // sort the phrases and then initiate the next step, which is to display them sort_phrases_by_rank(); ProcessTimer = window.setTimeout( "show_phrases( true )", ProcessPeriod ); } function sort_phrases_by_rank() { aQuickSort = PhraseList; quick_sort( 0, aQuickSort.length-1 ); } var aQuickSort; // Array of elements (strings, values, etc) function quick_sort_swap( one, tother ) { // ignore if swapping indicies are the same if (one != tother) { var temp = aQuickSort[one]; aQuickSort[one] = aQuickSort[tother]; aQuickSort[tother] = temp; } } function quick_sort( left, right ) { var i, splitPos; // count number of elements i = right - left; if (i <= 0) // one element in the array - do nothing return; if (i == 1) { // two elements - just swap them if in wrong order if (aQuickSort[left].rank < aQuickSort[right].rank) quick_sort_swap( left, right ); return; } // swap start for middle in case of an 'almost sorted' array quick_sort_swap( left, Math.floor( (left+right)/2 ) ); // split the array so that any elements ordered before the split-value are to the left of splitPos for (i=left+1, splitPos=left; i<=right; i++) { if (aQuickSort[i].rank < aQuickSort[left].rank) quick_sort_swap( ++splitPos, i ); } // swap back the start and middle elements quick_sort_swap( left, splitPos ); quick_sort( left, splitPos-1 ); // sort left-hand portion quick_sort( splitPos+1, right ); // sort right-hand portion } // Processor Settings // - user configurable settings that alter the nature of the algorithm var KeySetToUseId = 0; // index of the key set to be used to generate phrases var ProcessPeriod = 5; // delay in msecs between processing steps // The Top-Level Functionality // - called by the HTML to show a list of phrases on the HTML input form var IDLE_PROCESS = 0; var SEARCH_PROCESS = 1; var RANKING_PROCESS = 2; var ProcessTimer = null; // reference to timed callback var ProcessInProgress = IDLE_PROCESS; // id of the process currently running var ProcessStep = 0; // stage id of process currently running var ProcessProgress = 0; // progress meter (0-100) var ProcessProgressInc = 1; // increment to add to the progress meter after each completed step var ProcessProgressBar = new SimpleProgressBar( 300, 5, 50, "dial-a-phrase-files/GreyDot.gif", "dial-a-phrase-files/BlueDot.gif", "dial-a-phrase-files/BlackDot.gif" ); // progress bar object used to display progress on the web-page var PhraseList = null; // list of phrases generated function process() { get_phrases( document.dap.number.value ); rank_phrases(); sort_phrases_by_rank(); show_phrases(); } function process_background() { if (ProcessInProgress == IDLE_PROCESS) { start_search(); } else if (ProcessInProgress == SEARCH_PROCESS) { window.clearTimeout( ProcessTimer ); if (PhraseList.length > 0) { // ask user if they'd like to see the phrases found by the search before it was cancelled if (confirm( "Would you like to see the phrases found up to this point?" )) start_ranking(); else start_idle(); } else // no phrases were found, automatically cancel the search start_idle(); } else if (ProcessInProgress == RANKING_PROCESS) { window.clearTimeout( ProcessTimer ); if (PhraseList.length > 0) { // ask user if they'd like to see the phrases found without being sorted by rank if (confirm( "Would you like to see an un-sorted list of phrases found?" )) show_phrases(); else start_idle(); } else // no phrases were found, automatically cancel the search start_idle(); } } // The State Entry Methods // - called from various points of the code to change state (IDLE, SEARCH, RANK) function start_idle() { ProcessInProgress = IDLE_PROCESS; ProcessProgressBar.set_progress( SimpleProgressBar.INACTIVE ); document.dap.processcontrol.value = "Search for Phrases"; } function start_search() { // set the key-set here since it is needed to perform validation TelephoneNumber = new Array(); KeySetInUse = KeySets[KeySetToUseId]; CurrentPhrase = ""; // validate the telephone number entered; // at the same time determine the number of characters that will be searched var numberToSearch = document.dap.number.value; if (numberToSearch.length == 0) { alert( "Please enter a telephone number into the 'Telephone Number' text box." ); document.dap.number.focus(); } else { var isValid = true; var charSearchCount = 1; var digit; for (var i=0; i= goodRanking) break; phraseList += PhraseList[phraseIndex].text + " (rank: " + phraseRank + ")\n"; if (phraseRank != nextBestRank) upperRange = " - " + phraseRank; phraseIndex ++; } DisplayData[DisplayData.length] = new PhraseData( "Good phrases (ranked " + nextBestRank + upperRange + ")", phraseList ); } else { alert( "Sorry, no good phrases were found for this telephone number.\nHowever, there may be some memorable character sequences in the phrases that have been found." ); } } if (phraseIndex < numOfPhrases) { // compile a list of the remaining phrases phraseList = ""; while (phraseIndex < numOfPhrases) { phraseList += PhraseList[phraseIndex].text + " (rank: " + PhraseList[phraseIndex].rank + ")\n"; phraseIndex ++; } DisplayData[DisplayData.length] = new PhraseData( "Other phrases", phraseList ); } // compile a list of all phrases phraseList = ""; for (var i=0; i 0) displayMenu.options[displayMenu.options.length-1] = null; // add new items from latest search for (var i=0; i