Skip to main content

Vanity Number Wordification

Project description

Vanity Toll-free Number Python Module

A vanity number is a local or toll-free telephone number for which a subscriber requests an easily remembered sequence of numbers for marketing purposes. For example, '1-866-386-6481' => '1-866-FUNMIT1'

This is a Python Module implementing functionalities related to Vanity Toll-free Phone Numbers, like wordification generation, Number mapping, validation, etc. For example:

  • Number to word Generation: the Toll Free Number "1-800-724-6837" could be wordified to "1-800-PAINTER" for remembering easily, and there could be other wordifications.
  • Word to number mapping: The telephone number corresponding to the wordified number '1-866-FUNMIT1' is '1-866-386-6481'
  • Phone Number validation: '404739-92' and '6504939270' are NOT valid US Phone Numbers.

See the Python Module published in PyPi

Approach and Algorithm used

Main files are and

all_wordifications Given a valid Toll-free Number (e.g."1-800-724-6837"), we would like to generate and return various possible Vanity Numbers (e.g.["1-800-PAINTER", ...]), which are valid word combinations. This problem of generating valid word combinations of a phone number is approached by considering it as a graph problem, with Nodes called T9_Graph_Node representing possible combinations of characters for each of the digit, and Breadth first search is performed from the first digit, till the end of the number. Comparator operators has been over-ridden for T9_Graph_Node for performing custom comparison operations between Graph Nodes, during operations like sorting, min, max, etc.

While doing graph search, since it is required to frequently check if the prefix word is a valid dictionary word, Trie Data structure is Used. To populate the Trie, Dictionaries.txt is read and Trie Data Structure has been created and saved in a global variable. Python Dictionary type could also have been used for checking for a valid dictionary word, but it will Be more memory intensive to store all dictionary words in local memory while the program is running, and the program may crash for larger number of dictionary entries. Trie data structure can support much larger dictionary sizes.

The List of possible outputs are stored in Max Heap / Priority Queue for faster insertion and deletion queries and retrieving best N words, which is defined by comparator function (most number of English characters in wordified_number)

Graph Search (BFS) : For performing graph search, BFS is used, which is more intuitive to this problem that DFS

Number Validation: Since US phone numbers can come in slightly different formats (1-800-724-6837, 4046639270, 404-663-9270, 1-(866)-(724)-(6836), etc ) and to validate them handling these cases, Regular Expressions is used to validate, as well as compare phone numbers and fetch groups of area codes. Though sometimes it is recommended to avoid Regex, this usecase of fetching US phone number area codes looked more suitable for its use, to avoid writing complex and repeating logic for validating, matching and fetching groups of numbers in the US phone number, Regular expression approach is used.

number_to_words ->

words_to_number -> After sanity validation, converts each character to its corresponding T9 digit based on defined hash map. `

Performance Optimization
  • Checking for valid dictionary words Using Trie Data structure.
  • Trie data is populated and stored as a Global Constant. This avoids re-computation (dictionary file read and Trie populate) between multiple functions, and will save considerable time if dictionary file is larger.
  • When doing Graph search, if valid prefix of a dictionary word is Not formed, the graph search is pre-maturely discontinued at that stage.

Assumptions Made in this program

  • There are many words in the dictionary which are NOT Useful (yo, ey, si, fr) and Needs data cleaning. I've attempted to do data cleaning in but saved it for a later day. Hence the program has IGNORED ALL TWO LETTER WORDS

  • The Approach currently considers only maximum of combination of two words together, though it can be extended for more words.

Data structures and libraries used

The VanityNumber module uses Most Popular 20,000 words in a dictionary_20k.txt taken from google-10000-english

It uses the following Libraries for Data Structure:

  • pygtrie - Python library implementing a trie data structure, for checking valid dictionary word.

  • heapq - Python library for implementing a Min Heap Priority Queue, for returning top N nodes.

  • deque - Deque for implementing a Queue Data-structure for Breadth first graph search

Main files are and

Getting Started

Users Installation (Alpha version)

See the Alpha Release Python Module published in PyPi

pip install vanitynumber

Developers Installation

Instructions for installing in your development environment

git clone
cd vanitynumber/

virtualenv -p python3 my_env
source my_env/bin/activate

pip install -r requirements.txt
python install



>>>import vanitynumber




>['1-800-BOOKBEE', '1-800-CNNJADE',...]


Running the tests




This project is licensed under EULA Restrictive License - see the LICENSE file for details

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

vanitynumber-0.5.tar.gz (88.4 kB view hashes)

Uploaded source

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Fastly Fastly CDN Google Google Object Storage and Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page