Skip to main content

Open source resume templates with JSON-LD (SEO-friendly) support

I don't usually keep track of the projects that I worked on. I have been recently advised to keep resume updated with the projects list. And so I have searched for resume templates and tools.

Indian resume Vs International resume

During the process, I have found that there are vast differences between the format of Indian resumes and International resumes. Indian resumes are extremely verbose with number of projects, team size, client name, etc. whereas international format is more succinct and short. So I was kind of lost in the process in adopting the template.

LinkedIn to the rescue?

No. Unfortunately, LinkedIn format is "common" and is not easy to update. Moreover, these days LinkedIn has become signupware [sic] and so accessing resume is a nightmare.

Enter JSON Resume


JSON Resume is an awesome open source approach for creating resume. I accidentally came across while searching for JSON-LD format for resume. Couple of great features:
  1. Resume hosting (optional). I think, it is better to ignore this one.
  2. CLI tool to create resume JSON structure: resume-cli
  3. Templates or themes support. So number of themes are possible for same resume.
Apart from these, it has good ecosystem surrounding it with different tools and projects:
  1. Tool to generate JSON-LD out of it resumeToJSONLD
  2. Tool to generate JSON Resume from LinkedIn linkedin-to-json-resume
  3. Tool to generate Microsoft Word resumes from JSON Resume data ResumeFodder
  4. Skill set visualization using D3.js SkillSet
I have also noted similar approach from other project json_resume But, it is not using resume schema.

Caveat

Unfortunately, this project is not very active. It doesn't support projects list for Indian context, but we can work around it.

Update (June 11, 2020)

Now open source ecosystem has few other players:
  1. Resumake - has LaTeX support
  2. Reactive Resume - No support for JSON Resume yet and has few active forks

Comments

Popular posts from this blog

Open source PHP frameworks and problems

I was using CakePHP for sometime and proposed CakePlus , another UIMS toolkit on the top of CakePHP but also altering some problematic core of it. The thread should explain the outcome of the post. And, then I noted Akelos framework has most of the things built in. Issues with frameworks esp. CakePHP Scalability not a priority - Developers aren't aware that we can't throw more and more hardware Excessive use of regular expressions Evangelist isn't aware that the framework throws many queries unnecessarily More memory consumption - 100M would never be enough for a simple project Poor coding standards and practices - Prolong use of extract() often leads to more memory consumption Can't use the native approaches or baked codes. The override approach always lead to hard to debug codes Poor architected codes and no clear defined approaches. People belong to the cult drives the direction and often throws unprofiled codes. No native provision to share codes between M-V-C and...

What's wrong with delicious.com?

The recent UI changes of delicious.com is quite confusing and smells suicidal phase. I have noted that, after Joshua Schachter sold it to Yahoo!, it's going crazy changes. Probably, it's because a Yahoo! company now or Engineers don't get the real idea? Some crazy moves: del.icio.us to delicious.com change; probably to reach countries that censor .us TLD? delicious.com to www.delicious.com; unjustified Perl to PHP switch; why? for:handle geekish way to share to separate box; crazy but ok. Looks like, the new Yahoo! guys don't know how to make it a cult following like how twitter popularized @handle Recent broken UI

Interview question #2

This is related to PHP's array . An array has number of elements. All elements are integers and unique, which means there is no repetitive integers. (e.g.) $foo = array(7, 5, 9, 13, 2, 8); You have to sort the array, provided: You should scan the elements only once. You're not allowed to compare the elements when sorting. (i.e., you're not supposed to use any comparison operators) Sorted resultant array may not be the source array. How will you do that?